Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B

نویسندگان

  • Steve A. Schneider
  • Helen Treharne
چکیده

This paper introduces action refinement in the context of CSP‖B. Our motivation to include this notion of refinement within the CSP‖B framework is the desire to increase flexibility in the refinement process. We introduce the ability to change the events of a CSP process and the B machines when refining a system. Notions of refinement based on traces and on traces/divergences are introduced in which abstract events are refined by sequences of concrete events. A complementary notion of refinement between B machines is also introduced, yielding compositionality results for refinement of CSP‖B controlled components. The paper also introduces a notion of I/O refinement into our action refinement framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selected papers on Integrated Formal Methods (iFM09)

This issue contains extended versions of selected papers from the 7th International Conference on Integrated Formal Methods, iFM09, held on 16–19 February 2009 in Düsseldorf, Germany. The Integrated Formal Methods conference series seeks to further research into the combination of different formal methods, both for modeling and analysis, covering all aspects from language design over verificati...

متن کامل

A CSP Account of Event-B Refinement

Event-B provides a flexible framework for stepwise system development via refinement. The framework supports steps for (a) refining events (one-by-one), (b) splitting events (one-by-many), and (c) introducing new events. In each of the steps events can moreover possibly be anticipated or convergent. All such steps are accompanied with precise proof obligations. Still, it remains unclear what th...

متن کامل

Control Law Diagrams in Circus

Control diagrams are routinely used by engineers in the design of control systems. Yet, currently the formal verification of programs that implement the diagrams is a challenge. We present a strategy to translate block diagrams to Circus, a notation that combines Z, CSP, and a refinement calculus. This work is based on existing tools that produce Z and CSP specifications from discrete-time bloc...

متن کامل

Compositional Verification of a Network of CSP Processes: using FDR2 to verify refinement in the event of interface difference

The paper [5] presented an implementation relation formalising what it means for one process to “implement” another in the CSP (Communicating Sequential Processes, [15]) framework in the event that the two processes have different interfaces. An improved version of the relation appears in [6] and allows for compositional verification of a network of CSP processes. The model checker FDR2([15]) m...

متن کامل

CSP-Prover – a Proof Tool for the Verification of Scalable Concurrent Systems

The process algebra Csp [1] [4] [15] [16] is a formal method devoted to the modelling as well as to the analysis and verification of concurrent systems. It is a speciality of Csp that it captures both, the concurrent system as well as its desired properties, as specifications: Let Sys be the formal Csp model of a concurrent system, let P be a property formulated in Csp – such a property could, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 76  شماره 

صفحات  -

تاریخ انتشار 2009